"Little's law" meaning in All languages combined

{
  "etymology_text": "The theorem was proposed by American researcher John Little (1928–2024).",
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "Little's law",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Probability theory",
          "orig": "en:Probability theory",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              99,
              111
            ]
          ],
          "ref": "2017, Katherine Cox-Buday, Concurrency in Go […] , O'Reilly, →ISBN, page 130:",
          "text": "What about determining how large our queue needs to be to handle a desired number of requests. Can Little's Law help us answer that?",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A theorem which states that the long-term average number L of customers in a stationary system is equal to the long-term average effective arrival rate λ multiplied by the average time W that a customer spends in the system."
      ],
      "id": "en-Little's_law-en-noun-TL2FPvWH",
      "links": [
        [
          "probability theory",
          "probability theory"
        ],
        [
          "queueing theory",
          "queueing theory"
        ],
        [
          "theorem",
          "theorem"
        ],
        [
          "customer",
          "customer"
        ],
        [
          "stationary",
          "stationary"
        ]
      ],
      "qualifier": "queueing theory",
      "raw_glosses": [
        "(probability theory, queueing theory) A theorem which states that the long-term average number L of customers in a stationary system is equal to the long-term average effective arrival rate λ multiplied by the average time W that a customer spends in the system."
      ],
      "topics": [
        "mathematics",
        "probability-theory",
        "sciences"
      ],
      "wikipedia": [
        "John Little (academic)"
      ]
    }
  ],
  "word": "Little's law"
}

{
  "etymology_text": "The theorem was proposed by American researcher John Little (1928–2024).",
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "Little's law",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English nouns with unknown or uncertain plurals",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Probability theory"
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              99,
              111
            ]
          ],
          "ref": "2017, Katherine Cox-Buday, Concurrency in Go […] , O'Reilly, →ISBN, page 130:",
          "text": "What about determining how large our queue needs to be to handle a desired number of requests. Can Little's Law help us answer that?",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A theorem which states that the long-term average number L of customers in a stationary system is equal to the long-term average effective arrival rate λ multiplied by the average time W that a customer spends in the system."
      ],
      "links": [
        [
          "probability theory",
          "probability theory"
        ],
        [
          "queueing theory",
          "queueing theory"
        ],
        [
          "theorem",
          "theorem"
        ],
        [
          "customer",
          "customer"
        ],
        [
          "stationary",
          "stationary"
        ]
      ],
      "qualifier": "queueing theory",
      "raw_glosses": [
        "(probability theory, queueing theory) A theorem which states that the long-term average number L of customers in a stationary system is equal to the long-term average effective arrival rate λ multiplied by the average time W that a customer spends in the system."
      ],
      "topics": [
        "mathematics",
        "probability-theory",
        "sciences"
      ],
      "wikipedia": [
        "John Little (academic)"
      ]
    }
  ],
  "word": "Little's law"
}